Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

متن کامل

On monotonicity in parametric linear complementarity problems

This paper generalizes the answers that were given by R.W. Cottle to questions that were originally raised by G. Maier. Essentially, we give necessary and sufficient conditions for some notions of monotonicity of solutions for the parametric linear complementarity problem. Our proofs are direct ones and not algorithmic, as Cottle's proofs are, and also cover a broader class of matrices.

متن کامل

improved infeasible-interior-point algorithm for linear complementarity problems

we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

متن کامل

Variational Inequalities , Complementarity Problems and Pseudo - Monotonicity

It is well known that variational inequalities are systematically used in the theory of many practical problems related to ”equilibrium”. The equilibrium is an important state considered in Physics, Engineering, Sciences and Economics and even in Biology, [5], [37], [38], [24], [56]. When a variational inequality is defined on a closed convex set, which is in particular a closed convex cone, in...

متن کامل

An efficient algorithm for second-order cone linear complementarity problems

Recently, the globally uniquely solvable (GUS) property of the linear transformation M ∈ Rn×n in the second-order cone linear complementarity problem (SOCLCP) receives much attention and has been studied substantially. Yang and Yuan [30] contributed a new characterization of the GUS property of the linear transformation, which is formulated by basic linear-algebra-related properties. In this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1989

ISSN: 0022-247X

DOI: 10.1016/0022-247x(89)90347-8